Cross entropy-based memetic algorithms: An application study over the tool switching problem
نویسندگان
چکیده
منابع مشابه
Solving the tool switching problem with memetic algorithms
The tool switching problem (ToSP) is well known in the domain of flexible manufacturing systems. Given a reconfigurable machine, the ToSP amounts to scheduling a collection of jobs on this machine (each of them requiring a different set of tools to be completed), as well as the tools to be loaded/unloaded at each step to process these jobs, such that the total number of tool switches is minimiz...
متن کاملA Memetic Algorithm for the Tool Switching Problem
This paper deals with the Tool Switching Problem (ToSP), a well-known problem in operations research. The ToSP involves determining a job sequence and the tools to be loaded on a machine with the goal of minimizing the total number of tool switches. This problem has been tackled by a number of algorithmic approaches in recent years. Here, we propose a memetic algorithm that combines a problem-s...
متن کاملMemetic cooperative models for the tool switching problem
This work deals with memetic-computing agent-models based on the cooperative integration of search agents endowed with (possibly different) optimization strategies, in particular memetic algorithms. As a proof-ofconcept of the model, we deploy it on the tool switching problem (ToSP), a hard combinatorial optimization problem that arises in the area of flexible manufacturing. The ToSP has been t...
متن کاملA Memetic Cooperative Optimization Schema and Its Application to the Tool Switching Problem
This paper describes a generic (meta-)cooperative optimization schema in which several agents endowed with an optimization technique (whose nature is not initially restricted) cooperate to solve an optimization problem. These agents can use a wide set of optimization techniques, including local search, population-based methods, and hybrids thereof, hence featuring multilevel hybridization. This...
متن کاملMemetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA heuristic used to create the initial population and a local search operator based on a fine tuned Simulated Annealing algorithm. Its performance is investigated through extensive experimentation over well known benchm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2013
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2013.792542